搜索资源列表
Huffman-coding
- 通信的数字化是它能与计算机技术和数字信号处理技术相结合的基础，而实现通信数字化的前提是信源能提供的各种用于传递的消息，例如语音、图像、数据、文字等都必须以数字化形式表示。而信源编码是数字通信系统中的重要组成部分，他是保证信号有效传输的一种重要方式。霍夫曼编码依据字符出现的概率来构造异字头的平均长度最短的码字，有时称之为最佳编码，其优越的性能被广泛使用在数字通信系统中。霍夫曼编码已经成为数据压缩的灵魂算法。本文介绍了无失真编码算法的构造，霍夫曼编码的规则和特点，同时分析了对信源进行优化的方法，最后
Huffman-coding-in-C-language
- 用C语言实现huffman编码，生成txt文件，显示编码结果，压缩比。-Huffman coding in C language
Huffman-Coding
- 哈弗曼编译码,包含哈弗曼树、编码和解码过程。-Huffman Coding and Decoding
Huffman
- huffman编码压缩和解压缩文件，可以压缩文字，图片等-huffman coding to compress and decompress the file, can compress text, pictures, etc.
Huffman-coding
- 数据结构中的霍夫曼编码的源代码。对掌握c语言的数据结构有很好的帮助-Huffman coding in the data structure in the source code. Good master c language data structure
Huffman-coding-and-decoding
- 基于MATLAB的霍夫曼编码及解码源代码，可用于通信系统的MATLAB仿真-MATLAB simulation based on MATLAB Huffman coding and decoding source code can be used for the communication system
Huffman-coding-image-compression
- 使用哈夫曼编码对图像进行压缩，使用zigzag扫描，显示压缩后图像-Huffman coding image compression, using the zigzag scanning, image compression
Huffman-Coding
- 哈夫曼编码，C语言编写，将概率事件分别编写为对应二进制编码，适合在通信环境中传输-Huffman coding, C language, the probability of the event were written to the corresponding binary coding, suitable for transmission in a communications environment
Huffman-Coding
- 霍夫曼编码的简单示例程序 用于教学。有注释，方便学生自学。-Huffman Coding
Huffman-Coding-master
- huffman coding and decoding useful for begining java
Huffman-coding
- Huffman编码实现压缩算法，带界面。功能较简单。C++编写。-Huffman coding to achieve compression algorithm, with the interface. Function is relatively simple. C++ writing.
source-huffman-coding
- IMAGE KOMPRESI MENGGUNAKAN ALGORITMA HUFFMAN CODING
huffman-coding
- 在电报通讯中，电文是以二进制的0、1序列传送的。字符集中的字符的使用频率是不同的（比如e和t的使用较之q和z要频繁得多），哈夫曼编码可以使得编码的总长最短，从而相同的位长可以传送更多的信息。-In telegraph communications, the message is transmitted binary sequence 0,1. Frequency character sets are different (such as e q and t and z are used with
Huffman-coding-tree
- 用二叉树作为存储结构，实现霍夫曼树的编码以及01序列的解码-As with binary storage structure, to achieve Huffman coding tree
Huffman-coding
- 这是一个实现哈夫曼编码的算法，可以有效解决不等长字符的压缩-This is a Huffman coding algorithm can effectively solve the compression of unequal length character
error coding
- Huffman coding and cyclic redundancy check coding. Brief introduction and reports
Huffman-Coding
- 哈夫曼编码(Huffman Coding)是一种编码方式，哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法，该方法完全依据字符出现概率来构造异字头的平均长度最短的码字，有时称之为最佳编码-Huffman coding (Huffman Coding) is an encoding, Huffman coding is a variable length coding (VLC) kind. Huffman coding method proposed in 1
Huffman-coding-and-Compression--algorithm
- Huffman coding and Compression algorithm c++ code In computer science and information theory, a Huffman code is an optimal prefix code found using the algorithm developed by David A. Huffman while he was a Ph.D. student at MIT, and published in
Huffman-coding-and-decoding
- 完整的哈弗曼编码译码程序，信息论与编码课程实验中经常用到的程序-Complete Huffman coding and decoding procedures, information theory and coding course experiments frequently used programs
Huffman-coding
- 可以实现哈夫曼编码，简单易懂，可以用于交作业。欢迎下载-Huffman coding can be achieved, easy to understand, can be used for homework. Welcome to download